Using Matrix indexes for Resource Discovery in Grid Environment

There are many resources and services in grid environment which may be distributed geographically. So, resource discovery methods with lower update and discovery costs are of vital significance. The centralized methods have the advantage of improved management of nodes, but in a grid with large number of nodes and resources, a bottleneck is caused in the server, which reduces the system efficacy significantly. Decentralized methods proposed till now are not able to discover the required resources of the users and update their environment without any additional traffic and referral to unnecessary nodes. In this paper, we use a matrix in each node to reserve the local resources and the information of children to access the requested resources of the user. In our algorithm, each node uses indexes of resources in its matrix to present available resources to the parent node. The user delivers the indexes of the resource, which contains the least bits, to one of the tree nodes. The main advantage of our method is that the unnecessary and extra nodes are not visited in both discovery and update phase; i.e. not only reduces the discovery cost but also lowers the update costs. Our proposed approach is an efficient and easy method. The simulation results indicate that our method is the most optimal one compared to other methods considering the visited nodes in the discovery and updating as well as the lower traffic.